Art Galleries with Interior Walls
نویسنده
چکیده
Consider an art gallery formed by a polygon on n vertices with m pairs of vertices joined by interior diagonals, the interior walls. Each interior wall has an arbitrarily placed, arbitrarily small doorway. We will show that the minimum number of guards that suffice to guard all art galleries with n vertices and m interior walls is min{b(2n−3)/3c, b(2n+m−2)/4c, b(2m+n)/3c}. If we restrict ourselves to galleries with convex rooms of size at least r, the answer improves to min {m, b(n + m)/rc}. The proofs lead to linear time guard placement algorithms in most cases. The original art gallery problem, posed by Klee and solved by Chvátal [6], is to find the smallest number of guards necessary to cover any simple polygon, the art gallery, not necessarily convex, on n vertices. Here a covering by g guards means that one can find g points in the interior of the polygon such that every point in the interior is covered by some guard, that is for each point in the interior the line segment between it and some guard does not intersect the polygon. The comb polygons in figure 1 show that bn/3c guards are sometimes necessary – if n is not divisible by 3 simply take a comb on 3bn/3c vertices and subdivide one or two of its edges. Chvátal also showed that bn/3c guards always suffice. For more information on the history of this problem and related problems, see [15] and [17]. $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ # # # # # # # # # # # # # # # # # # # # # # # $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ # # # # # # # # # # # # # # # # # # # # # # # Figure 1: Comb polygons Hutchinson [11] generalized the basic art gallery problem by allowing interior walls. Throughout this paper an art gallery (with interior walls) will be a simple polygon on n vertices with some pairs of vertices joined by non-intersecting interior diagonals, the interior walls. Also suppose that in the interior of each of the walls Typeset by AMS-TEX 1
منابع مشابه
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
Art gallery problems are, broadly speaking, the study of the relation between the shapes of regions in the plane and the number of points needed to guard them. These problems have been extensively studied over the last decade and have found different type of applications in practical situation. Normally the number of sides of a polygon or the general shape of the polygon is used as a measure of...
متن کاملGuarding curvilinear art galleries with vertex
10 One of the earliest and most well known problems in computational geometry is 11 the so-called art gallery problem. The goal is to compute the minimum number of 12 guards needed to cover the interior of any polygon with n vertices; the guards are 13 to be placed on the vertices of the polygon. We consider the problem of guarding an 14 art gallery which is modeled as a polygon with curvilinea...
متن کاملGuarding curvilinear art galleries with vertex or point guards
One of the earliest and most well known problems in computational geometry is the socalled art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they cover the interior of the polygon. In this paper we consider the problem of guarding an art gallery which is modeled as a polygon with curvilinear walls. Our ma...
متن کاملA tight bound for point guards in piecewise convex art galleries
We consider the problem of guarding curvilinear art galleries. A closed arc a joining two points, p and q, in the plane is called a convex arc if the curve obtained by joining a with the line segment pq encloses a convex set. A piece-wise convex polygon P with vertices v0, . . . , vn−1 is the region bounded by a set {a0, . . . , an−1} of n convex arcs with pairwise disjoint interiors such that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 22 شماره
صفحات -
تاریخ انتشار 1999